Multi-phase Copying Garbage Collection in LOGFLOW*
نویسنده
چکیده
In this paper a new type of copying garbage collectors is presented. The main goal of the modification of the original method was the reduction of the memory area reserved by the collector. The new Multi-phase Copying Garbage Collection (MC-GC) algorithm reserves only a little part of the memory. It works in more than one phases, using all available free memory areas in each phase. Performance measurements show excellent efficiency of the MC-GC implementation in the LOGFLOW parallel Prolog system.
منابع مشابه
Garbage Collection in LOGFLOW*
The LOGFLOW is a distributed Prolog system running on multi-transputer machines and workstation clusters. The engines (Distributed Data Driven Prolog Abstract Machines, 3DPAM) execute the Prolog program parallel with fine-grain execution. Coarse-grain pieces of work are executed by traditional sequential WAM (Warren Abstract) machines. In the execution of logic programming languages the memory ...
متن کاملCopying garbage collection for WAM-based prolog systems
High-level programming languages like Prolog free the programmer from the burden of explicit memory management. In Prolog, dynamic memory allocation is done implicitly by creating data structures. The deallocation of data structures which are no longer in use, is the responsibility of the run-time system. Many Prolog implementations are based on the Warren Abstract Machine (WAM), a virtual mach...
متن کاملCache-Conscious Copying Collectors
Garbage collectors must minimize the scarce resources of cache space and off-chip communications bandwidth to optimize performance on modern single-chip computer architectures. Strategies for achieving these goals in the context of copying garbage collection are discussed. A multi-processor mutator/collector system is analyzed. Finally, the Intel 80860XP architecture is studied.
متن کاملGarbage Collection for Large Memory JAVA Applications
The possible applications of Java range from small applets to large, data-intensive scientiic applications allocating memory in the multi-gigabyte range. As a consequence copying garbage collectors can not fullll the requirements, as large objects can not be copied eeciently. We analyze the allocation patterns and object lifespans for diierent Java applications and present garbage collection te...
متن کاملNon-compacting Memory Allocation and Real-time Garbage Collection Dissertation Proposal
Garbage collection is the automatic reclamation of computer storage Knu73, Coh81, Wil92, Wil95]. While in many systems, programmers must explicitly reclaim heap memory at some point in their program by using a \free" or \dispose" statement, garbage collected systems free the programmer from this burden. In spite of its obvious attractiveness for many applications, garbage collection for real-ti...
متن کامل